Abstract Convexity and Fixed Points

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate Fixed Points in Abstract Interpretation

Much of the earlier development of abstract interpretation, and its application to imperative programming languages, has concerned techniques for finding fixed points in large (often infinite) lattices. The standard approach in the abstract interpretation of functional languages has been to work with small, finite lattices and this supposedly circumvents the need for such techniques. However, p...

متن کامل

Diagonal arguments and fixed points

‎A universal schema for diagonalization was popularized by N.S‎. ‎Yanofsky (2003)‎, ‎based on a pioneering work of F.W‎. ‎Lawvere (1969)‎, ‎in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function‎. ‎It was shown that many self-referential paradoxes and diagonally proved theorems can fit in that schema‎. ‎Here‎, ‎we fi...

متن کامل

Some Fixed and Periodic Points in Abstract Metric Spaces

and Applied Analysis 3 Let X, d be an abstract metric space. The following properties are often used, particularly in the case when the underlying cone is nonnormal. The only assumption is that the cone K is solid. For details about these properties see, for example, 11 . p1 If a ha where a ∈ K and h ∈ 0, 1 , then a θ. p2 If θ u c for each c, θ c, then u θ. p3 If u v and v w, then u w. p4 If c ...

متن کامل

Abstract Convexity and Augmented Lagrangians

Convexity and Augmented Lagrangians Regina S. Burachik University of South Australia and University of Ballarat Workshop on Advances in Continuous Optimization Reykjavik, Iceland Friday June 30 and Saturday July 1, 2006

متن کامل

Unique, guarded fixed points in an additive setting: Extended Abstract

x1 = t1(x1, . . . , xn, y1, . . . yp) .. (1) xn = tn(x1, . . . , xn, y1, . . . yp), where, typically, for each i ∈ [n], ti denotes a function ti : A → A, for some structure A. Sometimes, the structure A is equipped with a partial order, and the functions ti are order-preserving or continuous. In such a case, for a given p-tuple of elements y1, . . . , yp in A, one might ask for the least x1, . ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 1998

ISSN: 0022-247X

DOI: 10.1006/jmaa.1998.5918